Nearest-neighbor distribution for singular billiards
نویسندگان
چکیده
منابع مشابه
1 Nearest - neighbor distribution for singular billiards
The exact computation of the nearest-neighbor spacing distribution P (s) is performed for a rectangular billiard with point-like scat-terer inside for periodic and Dirichlet boundary conditions and it is demonstrated that when s → ∞ this function decreases exponentially. Together with the results of Ref. [13] it proves that spectral statistics of such systems is of intermediate type characteriz...
متن کاملAutomatic Data Distribution for Nearest Neighbor Networks
An algorithm for mapping an arbitrary multidimen sional array onto an arbitrarily shaped multidimen sional nearest neighbor network of a distributed mem ory machine is presented The individual dimensions of the array are labeled with high level usage descrip tors that can either be provided by the programmer or can be derived by sophisticated static compiler analy sis The presented algorithm ac...
متن کاملNearest Neighbor and Reverse Nearest Neighbor Queries for Moving Objects
With the proliferation of wireless communications and the rapid advances in technologies for tracking the positions of continuously moving objects, algorithms for efficiently answering queries about large numbers of moving objects increasingly are needed. One such query is the reverse nearest neighbor (RNN) query that returns the objects that have a query object as their closest object. While a...
متن کاملNearest Neighbor
Over the last decade, an immense amount of data has become available. From collections of photos, to genetic data, and to network traffic statistics, modern technologies and cheap storage have made it possible to accumulate huge datasets. But how can we effectively use all this data? The ever growing sizes of the datasets make it imperative to design new algorithms capable of sifting through th...
متن کاملNon-zero probability of nearest neighbor searching
Nearest Neighbor (NN) searching is a challenging problem in data management and has been widely studied in data mining, pattern recognition and computational geometry. The goal of NN searching is efficiently reporting the nearest data to a given object as a query. In most of the studies both the data and query are assumed to be precise, however, due to the real applications of NN searching, suc...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Physical Review E
سال: 2002
ISSN: 1063-651X,1095-3787
DOI: 10.1103/physreve.65.056214